Capped Asymmetric Elastic Net Support Vector Machine for Robust Binary Classification

نویسندگان

چکیده

Recently, there are lots of literature on improving the robustness SVM by constructing nonconvex functions, but they seldom theoretically study robust property constructed functions. In this paper, based our recent work, we present a novel capped asymmetric elastic net (CaEN) loss and equip it with as CaENSVM. We derive influence function estimators CaENSVM to explain proposed method. Our results can be easily extended other similar further show that is bounded, so explained. Other theoretical analysis demonstrates satisfies Bayes rule corresponding generalization error bound Rademacher complexity guarantees its good capability. Since CaEN concave, implement an efficient DC procedure stochastic gradient descent algorithm (Pegasos) solve optimization problem. A host experiments conducted verify effectiveness model.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Support Vector Machine Classifiers for Asymmetric Proximities

The aim of this paper is to afford classification tasks on asymmetric kernel matrices using Support Vector Machines (SVMs). Ordinary theory for SVMs requires to work with symmetric proximity matrices. In this work we examine the performance of several symmetrization methods in classification tasks. In addition we propose a new method that specifically takes classification labels into account to...

متن کامل

Common Spatial Patterns Feature Extraction and Support Vector Machine Classification for Motor Imagery with the SecondBrain

Recently, a large set of electroencephalography (EEG) data is being generated by several high-quality labs worldwide and is free to be used by all researchers in the world. On the other hand, many neuroscience researchers need these data to study different neural disorders for better diagnosis and evaluating the treatment. However, some format adaptation and pre-processing are necessary before ...

متن کامل

Support vector machine classification via parameterless robust linear programming

We show that the problem of minimizing the sum of arbitrary-norm real distances to misclassified points, from a pair of parallel bounding planes of a classification problem, divided by the margin (distance) between the two bounding planes, leads to a simple parameterless linear program. This constitutes a linear support vector machine (SVM) that simultaneously minimizes empirical error of miscl...

متن کامل

Robustified distance based fuzzy membership function for support vector machine classification

Fuzzification of support vector machine has been utilized to deal with outlier and noise problem. This importance is achieved, by the means of fuzzy membership function, which is generally built based on the distance of the points to the class centroid. The focus of this research is twofold. Firstly, by taking the advantage of robust statistics in the fuzzy SVM, more emphasis on reducing the im...

متن کامل

Robust Support Vector Machine With Bullet Hole Image Classification

This paper proposes a robust support vector machine for pattern classification, which aims at solving the over-fitting problem when outliers exist in the training data set. During the robust training phase, the distance between each data point and the center of class is used to calculate the adaptive margin. The incorporation of the average techniques to the standard support vector machine (SVM...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Intelligent Systems

سال: 2023

ISSN: ['1098-111X', '0884-8173']

DOI: https://doi.org/10.1155/2023/2201330